package datastructure.order.solution;

import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;

public class SolutionEasy {
    public void moveZeroes(int[] nums) {
        int left = 0;
        for (int right = 0; right < nums.length; right++) {
            if (nums[right] != 0) {
                if (left != right) {
                    nums[left] = nums[right];
                    nums[right] = 0;
                }
                left++;
            }
        }
    }

    /*public int findKthLargest(int[] nums, int k) {
        if (nums[0] < nums[1]) {

        }
        for (int i = 0; i < nums.length; i++) {

        }
    }*/
}
